#define _CRT_SECURE_NO_WARNINGS 1
#include "BinaryTree.h"


int main()
{
	BTNode* node1 = BuyNode('A');
	BTNode* node2 = BuyNode('B');
	BTNode* node3 = BuyNode('C');
	BTNode* node4 = BuyNode('D');
	BTNode* node5 = BuyNode('E');
	BTNode* node6 = BuyNode('F');
	BTNode* node7 = BuyNode('G');
	node1->left = node2;
	node1->right = node3;
	node2->left = node4;
	node2->right = node5;
	node3->left = node6;
	node3->right = node7;

	//BTPrevOrder(node1);
	//printf("\n");
	//BTInOder(node1);
	//printf("\n");
	//BTPostOder(node1);

	//BTDestory(node1);
	//printf("%p", node1);
	/*int n = BTSize(node1);*/
	/*int n = BTLeafSize(node1);*/
	/*int n = BTLevelKSize(node1,0);*/
	//BTNode* n = BTFind(node1, 'B');
	//printf("%c ", n->data);
	/*BTLevelOrder(node1);*/
	//printf(" %d ", BTComplete(node1));
	char a[100] = { "ABD##E#H##CF##G##" };
	int n = sizeof(a) / sizeof(char);
	int i = 0;
	BTNode* root = BTCreate(a, n, &i);
	BTPrevOrder(root);
	return 0;
}
